On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:
общая лексика
плотность записи
число единиц памяти, умещающееся на единице длины носителя. Измеряется обычно в битах на дюйм
Смотрите также
математика
решетчатая укладка
Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real-life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks how many of the same objects are required to completely cover every region of the container, where objects are allowed to overlap.
In a bin packing problem, you are given:
Usually the packing must be without overlaps between goods and other goods or the container walls. In some variants, the aim is to find the configuration that packs a single container with the maximal packing density. More commonly, the aim is to pack all the objects into as few containers as possible. In some variants the overlapping (of objects with each other and/or with the boundary of the container) is allowed but should be minimized.